Simplifying Triangulations
نویسندگان
چکیده
We give a new algorithm to simplify given triangulation with respect curve. The simplification uses flips together powers of Dehn twists in order complete polynomial time the bit-size
منابع مشابه
Simplifying triangulations
We give a new algorithm to simplify a given triangulation with respect to a given curve. The simplification uses flips together with powers of Dehn twists in order to complete in polynomial time in the bit-size of the curve. keywords. triangulations of surfaces, flip graphs, Dehn twists Mathematics Subject Classification (2010): 57M20
متن کاملSimplifying Triangulations of S
In this paper we describe a procedure to simplify any given triangulation of S using Pachner moves. We obtain an explicit exponential-type bound on the number of Pachner moves needed for this process. This leads to a new recognition algorithm for the 3-sphere.
متن کاملSimplifying Triangulations of S 3
In this paper we describe a procedure to simplify any given triangulation of S 3 using Pachner moves. We obtain an explicit exponential-type bound on the number of Pachner moves needed for this process. This leads to a new recognition algorithm for the 3-sphere.
متن کاملCounting triangulations and pseudo-triangulations of wheels
Motivated by several open questions on triangulations and pseudotriangulations, we give closed form expressions for the number of triangulations and the number of minimum pseudo-triangulations of n points in wheel configurations, that is, with n − 1 in convex position. Although the numbers of triangulations and pseudotriangulations vary depending on the placement of the interior point, their di...
متن کاملSimplifying CRISPR
eveloping cell lines for use as accurate models for disease has always been a challenging task. In order to replicate phenotypes or enable downstream experimentation, genome engineering of cell lines is required. Techniques enabling genome modification have evolved over a number of years, from simple viral vectors used to insert sequences in random locations, to more sophisticated methods that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2021
ISSN: ['1432-0444', '0179-5376']
DOI: https://doi.org/10.1007/s00454-021-00309-0